EE384Y Project Intermediate Report Enabling Class of Service for CIOQ Switches with Maximal Matching Algorithms
نویسنده
چکیده
Providing Qualities of Service (QoS) is a desirable feature for most network routers and switches. The capability to service differential classes is a prerequisite to enable QoS. It has been shown that Output Queued (OQ) switches implementing Weighted Fair Queuing (WFQ) can provide QoS. However, OQ switches have high speed requirements for the fabric switch and the memory bandwidth, which makes it hard to implement OQ switches with high line rates and large number of ports. Input Queued (IQ) switches only require the speed of fabric switch and memory bandwidth the same speed as the line rate. However, IQ switches with 100% throughput is impractical to implement, and with limited choices of maximum weight matching (MWM) scheduling algorithms, it is hard to find a scheduling algorithm to provide QoS. Combined Input Output Queued (CIOQ) switches require the speed of fabric switch and memory bandwidth a constant speed up on the speed of line rate, which makes it easier to implement it than OQ switches in practice. In fact, implementing maximal matching algorithms on CIOQ switches with speedup of 2 can provide 100% throughput. The matching algorithm can be implemented practically and the flexibility of the matching algorithms makes it possible to provide QoS for CIOQ switch with some speedup. In this paper, we first
منابع مشابه
EE384Y Project Intermediate Report Enabling Class of Service for CIOQ Switches with Maximal Weighted Algorithms
متن کامل
Pipelined Maximal Size Matching Scheduling Algorithms for CIOQ Switches
In this paper, we propose new pipelined request-grant-accept (RGA) and request-grant (RG) maximal size matching (MSM) algorithms to achieve speedup in combined input and output queueing (CIOQ) switches. To achieve a speedup factor , in the proposed pipelined RGA/RG MSM algorithms, we pipeline operations of finding matchings in scheduling cycles based on the observation that all matched inputs/o...
متن کاملPacket-based scheduling algorithm for CIOQ switches with multiple traffic classes
A packet-based least cushion first/most urgent first (PB-LCF/MUF) maximal matching algorithm is presented in this paper for combined input and output queued (CIOQ) switches with multiple traffic classes. The main benefit of using a CIOQ switch is to alleviate memory bandwidth requirement while providing quality of service (QoS) guarantee. It was proved that, with a speedup factor of 2, a CIOQ s...
متن کاملEfficient Scheduling for SDMG CIOQ Switches
Combined input and output queuing (CIOQ) switches are being considered as high-performance switch architectures due to their ability to achieve 100% throughput and perfectly emulate output queuing (OQ) switch performance with a small speedup factor S. To realize a speedup factor S, a conventional CIOQ switch requires the switching fabric and memories to operate S times faster than the line rate...
متن کاملAn Efficient Scheduling Algorithm for CIOQ Switches with Space-Division Multiplexing Expansion
Recently, CIOQ switches have attracted interest from both academic and industrial communities due to their ability of achieving 100% throughput and perfectly emulating OQ switch performance with a small speedup factor S. To achieve a speedup factor S, a conventional CIOQ switch requires the switch matrix and the memory to operate S times faster than the line rate. In this paper, we propose to u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004